Mechanism Reduction Based on Simulation Error Minimization

نویسندگان

  • Tibor Nagy
  • Tamás Turányi
چکیده

The work was supported by OTKA fund T68256. Abstract—A new species reduction method called the Simulation Error Minimization Connectivity Method (SEMCM) was developed. According to the SEM-CM algorithm, a mechanism building procedure is started from the important species. Strongly connected sets of species, identified on the basis of the normalized Jacobian, are added and several consistent mechanisms are produced. The model is simulated with each of these mechanisms and the mechanism causing the smallest error (i.e. deviation from the model that uses the full mechanism), considering the important species only, is selected. Then, in several steps other strongly connected sets of species are added, the size of the mechanism is gradually increased and the procedure is terminated when the error becomes smaller than the required threshold. A new method for the elimination of redundant reactions is also presented, which is called the Principal Component Analysis of Matrix F with Simulation Error Minimization (SEM-PCAF). According to this method, several reduced mechanisms are produced by using various PCAF-thresholds. The reduced mechanism having the least CPU time requirement among the ones having almost the smallest error is selected. Application of SEMCM and SEM-PCAF together provides a very efficient way to eliminate redundant species and reactions from large mechanisms. The suggested approach was tested on a mechanism containing 6874 irreversible reactions of 345 species that describes methane partial oxidation to high conversion. The aim is to accurately reproduce the concentration−time profiles of 12 major species with less than 5% error at the conditions of an industrial application. The reduced mechanism consists of 246 reactions of 47 species and its simulation is 116 times faster than using the full mechanism. The SEM-CM was found to be more effective than the classic Connectivity Method, and also than the DRG, two-stage DRG, DRGASA, basic DRGEP and extended DRGEP methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction

For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...

متن کامل

Optimal Control Pressure for Leakage Minimization in Water Distribution Systems Using Imperialist Competitive Algorithm

One of the key factors affecting leakage in water distribution systems is network pressure management by putting Pressure Reduce Valves (PRV) in the flow path and optimal regulation of these vales in water networks. This study aimed at investigating optimal pressure management problems so as to minimize leakage in water distribution networks. To do so, an approach was proposed for both optimal ...

متن کامل

A Neural Network Method Based on Mittag-Leffler Function for Solving a Class of Fractional Optimal Control Problems

In this paper, a computational intelligence method is used for the solution of fractional optimal control problems (FOCP)'s with equality and inequality constraints. According to the Ponteryagin minimum principle (PMP) for FOCP with fractional derivative in the Riemann- Liouville sense and by constructing a suitable error function, we define an unconstrained minimization problem. In the optimiz...

متن کامل

Cyclic block coordinate minimization algorithms for DOA estimation in co-prime arrays

We derive several closed-form expressions that generalize co-prime array system model and study a nonnegative gridless compressive sensing formulation of the problem of estimating direction-of-arrival (DOA) based on the derived model. To solve the problem, two computationally efficient cyclic block coordinate minimization algorithms are proposed; the algorithms perform atomic norm minimization ...

متن کامل

Reduction in Cache Memory Power Consumption based on Replacement Quantity

Today power consumption is considered to be one of the important issues. Therefore, its reduction plays a considerable role in developing systems. Previous studies have shown that approximately 50% of total power consumption is used in cache memories. There is a direct relationship between power consumption and replacement quantity made in cache. The less the number of replacements is, the less...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009